Supporting Non-membership Proofs with Bilinear-map Accumulators

نویسندگان

  • Ivan Damgård
  • Nikos Triandopoulos
چکیده

In this short note, we present an extension of Nguyen’s bilinear-map based accumulator scheme [8] to support non-membership witnesses and corresponding non-membership proofs, i.e., cryptographic proofs that an element has not been accumulated to a given set. This complements the non-membership proofs developed by Li et al. [7] for the RSA accumulator [2, 3, 5], making the functionality of the bilinear-map accumulator equivalent to that of the RSA accumulator. Our non-membership extension of Nguyen’s scheme [8] makes use of the q-Strong Diffie-Hellman assumption the security of the original scheme is based on.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Accumulators from Bilinear Pairings and Applications to ID-based Ring Signatures and Group Membership Revocation

We propose a dynamic accumulator scheme from bilinear pairings, whose security is based on the Strong Diffie-Hellman assumption. We show applications of this accumulator in constructing an identitybased (ID-based) ring signature scheme with constant-size signatures and its interactive counterpart, and providing membership revocation to group signature, traceable signature and identity escrow sc...

متن کامل

Zero-Knowledge Accumulators and Set Operations

Accumulators provide a way to succinctly represent a set with elements drawn from a given domain, using an accumulation value. Subsequently, short proofs for the set-membership (or non-membership) of any element from the domain can be constructed and efficiently verified with respect to this accumulation value. Accumulators have been widely studied in the literature, primarily, as an authentica...

متن کامل

Universal Accumulators with Efficient Nonmembership Proofs

Based on the notion of accumulators, we propose a new cryptographic scheme called universal accumulators. This scheme enables one to commit to a set of values using a short accumulator and to efficiently compute a membership witness of any value that has been accumulated. Unlike traditional accumulators, this scheme also enables one to efficiently compute a nonmembership witness of any value th...

متن کامل

QA-NIZK Arguments in Asymmetric Groups: New Tools and New Constructions

A sequence of recent works have constructed constant-size quasi-adaptive (QA) NIZK argu-ments of membership in linear subspaces of Ĝ, where Ĝ is a group equipped with a bilinear mape : Ĝ×Ȟ→ T. Although applicable to any bilinear group, these techniques are less useful in theasymmetric case. For example, Jutla and Roy (Crypto 2014) show how to do QA aggregation ofGroth-Sahai ...

متن کامل

Certificate Transparency with Enhancements and Short Proofs

Browsers can detect malicious websites that are provisioned with forged or fake TLS/SSL certificates. However, they are not so good at detecting malicious websites if they are provisioned with mistakenly issued certificates or certificates that have been issued by a compromised certificate authority. Google proposed certificate transparency which is an open framework to monitor and audit certif...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IACR Cryptology ePrint Archive

دوره 2008  شماره 

صفحات  -

تاریخ انتشار 2008